QoS multicast aggregation under multiple additive constraints
نویسندگان
چکیده
0140-3664/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.comcom.2008.05.044 * Corresponding author. E-mail addresses: [email protected] (N. Be ensi.rnu.tn (A. Belghith). IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although such a proposition has been well studied, there are still some inherent problems for its widespread deployment. In this paper, we propose a new algorithm coined mQMA that deals with the two main problems of traditional IP multicast, i.e., multicast forwarding state scalability and multi-constrained QoS routing. The algorithm mQMA is a QoS multicast aggregation algorithm which handles multiple additive QoS constraints. It builds few trees and maintains few forwarding states for the groups thanks to the technique of multicast tree aggregation, which allows several groups to share the same delivery tree. Moreover, the algorithm mQMA builds trees satisfying multiple additive QoS constraints. We show via extensive simulations that mQMA reduces dramatically the number of trees to be maintained and reduces the utilization of the network resources, yet it leverages the same overall QoS performances as Mamcra which is the main known multi-constrained multicast routing algorithm. 2008 Elsevier B.V. All rights reserved.
منابع مشابه
A Multicast Routing Protocol with Multiple QoS Constraints
The next generation Internet and high-performance networks are expected to support multicast routing with QoS constraints. To facilitate this, QoS multicast routing protocols are pivotal in enabling new member to join a multicast group. Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multipl...
متن کاملMλT: a multicast protocol with QoS support
This paper describes the new multicast protocol MλT, supporting QoS requirements. MλT is dedicated to any QoS parameter λ that is either additive (e.g., delay), or convex (e.g., available bandwidth). MλT constructs a multicast tree connecting a group of users such that, for any user x, the QoS λ supported by the path from the root of the tree to x is optimized under some constraints of bounded ...
متن کاملReceiver-Initiated Multicasting with Multiple QoS Constraints
In this report we present our work on a receiver-initiated approach called RIMQoS to support multicast with multiple QoS constraints and dynamic memberships. Assuming link-state information is available, a receiver computes a path to join the multicast tree rooted at the source. It then sends join request along the path to join the group. We first present the operation of our approach in an int...
متن کاملUnicast and Multicast QoS Routing with Multiple Constraints
We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for the unicast case. We then explore the use of optimization techniques in devising heuristics for QoS routing both in the unicast and multicast settings using algorithmic techniques as well as techniques from optimization theory. We...
متن کاملSpecial report Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA
Usually multiple quality of service (QoS) guarantees are required in most multicast applications. This paper presents a multiple constraints algorithm for multicast traffic engineering in mobile ad hoc networks (MANET). The proposed algorithm is a new version of multiple constraints QoS multicast routing optimization algorithm in MANET based on genetic algorithm (MQMGA). The proposed MQMGA can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 31 شماره
صفحات -
تاریخ انتشار 2008